Integer-Type Gene-Coding Method Based on Quantum Bit Representation in Quantum-Inspired Evolutionary Algorithm: Application to Integer Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Balanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...
متن کاملA Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem
This paper introduces an evolutionary algorithm which uses the concepts and principles of the quantum-inspired evolutionary approach and the hierarchical arrangement of the compartments of a P system. The P system framework is also used to formally specify this evolutionary algorithm. Extensive experiments are conducted on a well-known combinatorial optimization problem, the knapsack problem, t...
متن کاملSolution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm
Knapsack Problem (KP) is a popular combinatorial optimization problem having application in many technical and economic areas. Several attempts have been made in past to solve the problem. Various exact and non-exact approaches exist to solve KP. Exact algorithms for KP are based on either branch and bound or dynamic programming technique. Heuristics exist which solve KP non-exactly in lesser t...
متن کاملQuantum - inspired Evolutionary Algorithm
This thesis proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the popu...
متن کاملQuantum-Inspired Evolutionary Algorithm to Solve Graph Coloring Problem
Graph Coloring Problem (GCP) bears an enormous significance to the researchers in the field of soft computing. In this paper, we demonstrate a Quantum-Inspired Evolutionary Algorithm (QEA) to solve GCP. We use two dimensional arrays of Q-bits called Q-bit individual to produce binary individual. Q-gate operation is applied as a variation operator on Q-bit individuals. In traditional evolutionar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing
سال: 2012
ISSN: 1342-6230,1880-1013
DOI: 10.2299/jsp.16.495